A Defeasible Logic Reasoner for the Semantic Web

نویسندگان

  • Nick Bassiliades
  • Grigoris Antoniou
  • Ioannis P. Vlahavas
چکیده

Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is, among others, useful for ontology integration, where conflicting information arises naturally; and for the modeling of business rules and policies, where rules with exceptions are often used. This paper describes these scenarios in more detail, and reports on the implementation of a system for defeasible reasoning on the Web. The system is called DR-DEVICE and is capable of reasoning about RDF metadata over multiple Web sources using defeasible logic rules. The system is implemented on top of CLIPS production rule system and builds upon R-DEVICE, an earlier deductive rule system over RDF metadata that also supports derived attribute and aggregate attribute rules. Rules can be expressed either in a native CLIPS-like language, or in an extension of the OO-RuleML syntax. The operational semantics of defeasible logic are implemented through compilation into the generic rule language of R-DEVICE. The paper also briefly presents a semantic web broker example for apartment renting.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Modal Defeasible Reasoner of Deontic Logic for the Semantic Web

Defeasible logic is a non-monotonic formalism that deals with incomplete and conflicting information, whereas modal logic deals with the concepts of necessity and possibility. These types of logics play a significant role in the emerging Semantic Web, which enriches the available Web information with meaning, leading to better cooperation between end-users and applications. Defeasible and modal...

متن کامل

Dually Structured Concepts in the Semantic Web: Answer Set Programming Approach

There is an ongoing discussion whether reasoning in the Semantic Web should be monotonic or not. It seems however that the problem concerns not only the reasoning over knowledge but knowledge itself, where apart from nondefeasible knowledge the prototypical knowledge can be distinguished. In the current paper we rely on the cognitive Dual Theory comprising the classical theory of definition wit...

متن کامل

The Making of SPINdle

We present the design and implementation of SPINdle – an open source Java based defeasible logic reasoner capable to perform efficient and scalable reasoning on defeasible logic theories (including theories with over 1 million rules). The implementation covers both the standard and modal extensions to defeasible logics. It can be used as a standalone theory prover and can be embedded into any a...

متن کامل

Justification and Defeat

This paper exhibits some problematic cases of defeasible or nonmonotonic reasoning that tend to be handled incorrectly by all of the theories of defeasible and nonmonotonic reasoning in the current literature. The paper focuses particularly on default logic, circumscription, and the author’s own argument-based approach to defeasible reasoning. A proposal is made for how to deal with these probl...

متن کامل

Artificial Intelligence Justification and defeat

This paper exhibits some problematic cases of defeasible or nonmonotonic reasoning that tend to be handled incorrectly by all of the theories of defeasible and nonmonotonic reasoning in the current literature. The paper focuses particularly on default logic, circumscription, and the author's own argument-based approach to defeasible reasoning. A proposal is made for how to deal with these probl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004